Some permutations with forbidden subsequences and their inversion number

نویسندگان

  • Elena Barcucci
  • Alberto Del Lungo
  • Elisa Pergola
  • Renzo Pinzani
چکیده

A permutation avoids the subpattern i3 has no subsequence having all the same pairwise comparisons as , and we write ∈ S( ). We examine the classes of permutations, S(321); S(321; 37 142) and S(4231; 4132), enumerated, respectively by the famous Catalan, Motzkin and Schr; oder number sequences. We determine their generating functions according to their length, number of active sites and inversion number. We also <nd the average inversion number for each class. Finally, we describe some bijections between these classes of permutations and some classes of parallelogram polyominoes, from which we deduce some relations between the parameters of Motzkin and Schr; oder permutations. c © 2001 Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating trees and forbidden subsequences

We discuss an enumerative technique called generating frees which was introduced in the study of Baxter permutations. We apply the technique to some other classes of permutations with forbidden subsequences. We rederive some known results, e.g. ]S,(132,231)[ = 2” and l&,(123,132,213)1 = F,, and add several new ones: &(123,3241), S,(123,3214),8,(123,2143). Finally, we argue for the broader use o...

متن کامل

Permutations avoiding an increasing number of length-increasing forbidden subsequences

A permutation is said to be –avoiding if it does not contain any subsequence having all the same pairwise comparisons as . This paper concerns the characterization and enumeration of permutations which avoid a set of subsequences increasing both in number and in length at the same time. Let be the set of subsequences of the form “ ”, being any permutation on . For ! the only subsequence in #" i...

متن کامل

Stirling numbers interpolation using permutations with forbidden subsequences

We present a family of number sequences which interpolates between the sequences Bn, of Bell numbers, and n!. It is de ned in terms of permutations with forbidden patterns or subsequences. The introduction, as a parameter, of the number m of right{to{left minima yields an interpolation between Stirling numbers of the second kind S(n;m) and of the rst kind (signless) c(n;m). Moreover, q-counting...

متن کامل

Permutations with forbidden subsequences and nonseparable planar maps

The goal of the present work is to connect combinatorially a family of maps to a family of permutations with forbidden subsequences. We obtain a generating tree of nonseparable planar rooted maps and show that this tree is the generating tree of a family of permutations. The distribution of these permutations is then obtained. Finally, the different steps leading to the combinatorial proof of W...

متن کامل

Sorting Permutations on Two Parallel Stacks

We give a new combinatorial proof, based on stack graphs, for the characterization by forbidden subsequences of the permutations which are sortable on two parallel stacks. Some remarks about the permutations sortable on parallel queues are also made.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 234  شماره 

صفحات  -

تاریخ انتشار 2001